36B - Fractal - CodeForces Solution

#include <bits/stdc++.h>
#define ll long long

using namespace std;

ll n, k, res;
char a[250][250], ans[250][250], b[250][250];

void solve() {
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> a[i][j];
			ans[i][j] = a[i][j];
			b[i][j] = a[i][j];
		}
	}
	k--;
	res = n;
	while (k--) {
		for (int i = 1; i <= res; i++) {
			for (int j = 1; j <= res; j++) {
				if (a[i][j] == '*') {
					for (int p = (i - 1) * n + 1; p <= i * n; p++) {
						for (int q = (j - 1) * n + 1; q <= j * n; q++) {
							ans[p][q] = '*';
						}
					}
				} else {
					for (int p = (i - 1) * n + 1; p <= i * n; p++) {
						for (int q = (j - 1) * n + 1; q <= j * n; q++) {
							ans[p][q] = b[p - (i - 1) * n][q - (j - 1) * n];
						}
					}
				}
			}
		}
		res *= n;
		for (int i = 1; i <= res; i++) {
			for (int j = 1; j <= res; j++) {
				a[i][j] = ans[i][j];
			}
		}
	}
	for (int i = 1; i <= res; i++) {
		for (int j = 1; j <= res; j++) {
			cout << ans[i][j];
		}
		cout << "\n";
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll T = 1;
	while (T--)
		solve();
}